On (Cn;k) Stable Graphs
نویسندگان
چکیده
A graph G is called (H; k)-vertex stable if G contains a subgraph isomorphic to H ever after removing any k of its vertices; stab(H; k) denotes the minimum size among the sizes of all (H; k)-vertex stable graphs. In this paper we deal with (Cn; k)vertex stable graphs with minimum size. For each n we prove that stab(Cn; 1) is one of only two possible values and we give the exact value for infinitely many n’s. Furthermore we establish an upper and lower bound for stab(Cn; k) for k ≥ 2.
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملDistance magic circulant graphs
Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, 2, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the open neighborhood of v. In this paper we deal with circulant graphs C(1, p). The circulant graph Cn(1, p) is the graph on the vertex set V = {x0, x1, . . . , xn−1} with edges (xi, xi...
متن کاملConnected permutation graphs
A permutation graph is a simple graph associated with a permutation. Let cn be the number of connected permutation graphs on n vertices. Then the sequence {cn} satisfies an interesting recurrence relation such that it provides partitions of n! as n! =nk=1 ck · (n− k)!. We also see that, if uniformly chosen at random, asymptotically almost all permutation graphs are connected. © 2007 Elsevier B....
متن کاملToroidal Grids Are Anti-magic
An anti-magic labeling of a finite simple undirected graph with p vertices and q edges is a bijection from the set of edges to the integers {1, ..., q} such that all p vertex sums are pairwise distinct, where the vertex sum on a vertex is the sum of labels of all edges incident to such vertex. A graph is called anti-magic if it has an anti-magic labeling. Hartsfield and Ringel [3] conjectured t...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011